Conditional Matching Preclusion Number of Certain Graphs
نویسندگان
چکیده
The matching preclusion number of a graph is the minimum number of neither edges whose deletion in a graph has a neither perfect matching nor an almost perfect matching. For many interconnection networks, the optimal sets are precisely those induced by a single vertex. Recently the conditional matching preclusion number of a graph was introduced to look for sets beyond those induced by a single vertex. It is defined to be the minimum number of edges whose deletion results in a graph with no isolated vertices and has neither a perfect matching nor almost perfect matching. In this paper we find the conditional matching preclusion number for triangular ladder, Cn with parallel chords, Trampoline Graph, diamond Snake Graph and KPolygonal Snake Graph.
منابع مشابه
NP-completeness of anti-Kekulé and matching preclusion problems
Anti-Kekulé problem is a concept of chemical graph theory precluding the Kekulé structure of molecules. Matching preclusion and conditional matching preclusion were proposed as measures of robustness in the event of edge failure in interconnection networks. It is known that matching preclusion problem on bipartite graphs is NP-complete. In this paper, we mainly prove that anti-Kekulé problem on...
متن کاملConditional matching preclusion for hypercube-like interconnection networks
The conditional matching preclusion number of a graph with n vertices is the minimum number of edges whose deletion results in a graph without an isolated vertex that does not have a perfect matching if n is even, or an almost perfect matching if n is odd. We develop some general properties on conditional matching preclusion and then analyze the conditional matching preclusion numbers for some ...
متن کاملMatching preclusion and conditional matching preclusion for bipartite interconnection networks I: Sufficient conditions
The matching preclusion number of a graph is the minimum number of edges whose deletion results in a graph that has neither perfect matchings nor almost-perfect matchings. For many interconnection networks, the optimal sets are precisely those induced by a single vertex. Recently, the conditional matching preclusion number of a graph was introduced to look for obstruction sets beyond those indu...
متن کاملMatching preclusion and conditional matching preclusion for bipartite interconnection networks II: Cayley graphs generated by transposition trees and hyper-stars
The matching preclusion number of a graph with an even number of vertices is the minimum number of edges whose deletion results in a graph that has no perfect matchings. For many interconnection networks, the optimal sets are precisely those induced by a single vertex. It is natural to look for obstruction sets beyond those induced by a single vertex. The conditional matching preclusion number ...
متن کاملMatching Preclusion Number in Cartesian Product of Graphs and its Application to Interconnection Networks
The matching preclusion number of a graph G, mp(G), is the minimum number of edges whose deletion leaves a resulting graph that has neither perfect matchings nor almost perfect matchings. Besides its theoretical linkage with conditional connectivity and extremal graph theory, the matching preclusion number is a measure of robustness in interconnection networks. In this paper we develop general ...
متن کامل